A Distributed K-Means Segmentation Algorithm Applied to Lobesia botrana Recognition
نویسندگان
چکیده
منابع مشابه
Parallelization of the Algorithm K-means Applied in Image Segmentation
Algorithm k-means is useful for grouping operations; however, when is applied to large amounts of data, its computational cost is high. This research propose an optimization of k-means algorithm by using parallelization techniques and synchronization, which is applied to image segmentation. In the results obtained, the parallel k-means algorithm, improvement 50% to the algorithm sequential k-me...
متن کاملDistributed k-means algorithm
In this paper we provide a fully distributed implementation of the k-means clustering algorithm, intended for wireless sensor networks where each agent is endowed with a possibly high-dimensional observation (e.g., position, humidity, temperature, etc.). The proposed algorithm, by means of one-hop communication, partitions the agents into measure-dependent groups that have small ingroup and lar...
متن کاملA Weighted K-means Algorithm applied to Brain Tissue Classification
Tissue classification in Magnetic Resonance (MR) brain images is an important issue in the analysis of several brain dementias. This paper presents a modification of the classical K-means algorithm taking into account the number of times specific features appear in an image, employing, for that purpose, a weighted mean to calculate the centroid of every cluster. Pattern Recognition techniques a...
متن کاملOchratoxin A Management in Vineyards by Lobesia botrana Biocontrol
Grape berries attacked by Lobesia botrana larvae are more easily infected by Aspergillus section Nigri (black aspergilli) ochratoxigenic species. Two-year field trials were carried out in Apulia (Italy) to evaluate a bioinsecticide control strategy against L. botrana and the indirect effect on reducing ochratoxin A (OTA) contamination in vineyards. A commercial Bacillus thuringiensis formulate...
متن کاملK-means Iterative Fisher (KIF) unsupervised clustering algorithm applied to image texture segmentation
The K-means Iterative Fisher (KIF) algorithm is a robust, unsupervised clustering algorithm applied here to the problem of image texture segmentation. The KIF algorithm involves two steps. First, K-means is applied. Second, the K-means class assignments are used to estimate parameters required for a Fisher linear discriminant (FLD). The FLD is applied iteratively to improve the solution. This c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Complexity
سال: 2017
ISSN: 1076-2787,1099-0526
DOI: 10.1155/2017/5137317